The Grothendieck Program
ثبت نشده
چکیده
The definition of the Grothendieck-Teichmüller group by Drinfeld was motivated by applications to quantum group theory and by Grothendieck’s program aiming to understand a geometric counterpart of absolute Galois groups. The purpose of the this outlook chapter is to give an overview of this program, and to survey the connections between the structures occurring in our study of the homotopy of operads and the objects arising on the arithmetic side of the subject. In Grothendieck’s proposal [101], the fundamental objects are the moduli spaces of marked curves Mgn already considered in §4.3.5 in the genus zero case. We mostly deal with this case g = 0 yet. We then have
منابع مشابه
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the integrality gap between two optimization problems: A difficult semidefinite program with rank-1 constraint and its easy semidefinite relaxation where the rank constrained is dropped. For instance, the integrality gap ...
متن کاملGrothendieck-type inequalities in combinatorial optimization
We survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity.
متن کاملApproximating the Little Grothendieck Problem over the Orthogonal Group
The little Grothendieck problem (a special case of Boolean quadratic optimization) consists of maximizing ∑ ij Cijxixj over binary variables xi ∈ {±1}, where C is a positive semidefinite matrix. In this paper we focus on a natural generalization of this problem, the little Grothendieck problem over the orthogonal group. Given C ∈ Rdn×dn a positive semidefinite matrix, the objective is to maximi...
متن کاملA sub-constant improvement in approximating the positive semidefinite Grothendieck problem
Semidefinite relaxations are a powerful tool for approximately solving combinatorial optimization problems such as MAX-CUT and the Grothendieck problem. By exploiting a bounded rank property of extreme points in the semidefinite cone, we make a sub-constant improvement in the approximation ratio of one such problem. Precisely, we describe a polynomial-time algorithm for the positive semidefinit...
متن کاملApproximating the little Grothendieck problem over the orthogonal and unitary groups
The little Grothendieck problem consists of maximizing Σ ij Cijxixj for a positive semidef-inite matrix C, over binary variables xi ∈ {±1}. In this paper we focus on a natural generalization of this problem, the little Grothendieck problem over the orthogonal group. Given C ∈ ℝ dn × dn a positive semidefinite matrix, the objective is to maximize [Formula: see text] restricting Oi to take values...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014